On Characterization of Distance of a Path
نویسندگان
چکیده
Let Pn be the path graph on n vertices. In this paper, we consider the distance graphs G(Pn, D), where the distance set D ⊆ {1, 2, 3, . . . , n− 1}. We characterize the distance set D for which G(Pn, D) is one of path, cycle, wheel, regular, bipartite, acyclic, Cr-free, K1,r-free, or having isolated vertices.
منابع مشابه
A Study on Exponential Fuzzy Numbers Using alpha-Cuts
In this study a new approach to rank exponential fuzzy numbers using -cuts is established. The metric distance of the interval numbers is extended to exponential fuzzy numbers. By using the ranking of exponential fuzzy numbers and using -cuts the critical path of a project network is solved and illustrated by numerical examples. Keywords: Exponential Fuzzy Numbers, -cuts, Metric Dista...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملPlasma spraying and characterization of chromium carbide – nickel chromium coatings
Chromium carbide – nickel chromium powder Cr3C2-25wt.NiCr was plasma sprayed by a water-stabilized system WSP®. A series of experiments with variable feeding distance was carried out. Basic characterization of coatings was done by XRD, SEM and light microscopy plus image analysis. Microhardness was measured on polished cross sections. The main focus of investigation was on resistances against w...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملImprovement Least-Distance Measure Model with Coplanar DMU on Strong Hyperplanes
Technique of Data Envelopment Analysis (DEA) involves methods conducted for desirable objective management of Decision Making Unit (DMU) that is same increasing of efficiency level. Data envelopment analysis furthermore determines the efficiency level, provides situation, removes inefficiency with evaluated benchmarking information. In this paper the use of the improvement Least-Distance me...
متن کاملOn the distance based indices of H-phenylenic nanotorus
Let G be a connected simple (molecular) graph. The distance d(u, v) between two vertices u and v of G is equal to the length of a shortest path that connects u and v. In this paper we compute some distance based topological indices of H-Phenylenic nanotorus. At first we obtain an exact formula for the Wiener index. As application we calculate the Schultz index and modified Schultz index of this...
متن کامل